An Exhaustive and Edge-Removal Algorithm to Find Cores in Implicit Communities
نویسندگان
چکیده
Web community is intensely studied in web resource discovery. Many literatures use core as the signature of a community. A core is a complete bipartite graphs, denoted as Ci,j. But discovery of all possible Ci,j in the web is a challenging job. This work has been investigated by trawling [1][2]. Trawling employs repeated elimination/generation procedure until the graph is pruned to a satisfied state and then enumerate all possible Ci,j. We proposed a new method that uses exhaustive and edge removal method. Our algorithm avoids scanning dataset many times. Also, we improve crawling method by only recording potential fans to save disk space. The experiment result show that the new algorithm works properly and many new Ci,j can be found by our method.
منابع مشابه
Detecting communities of workforces for the multi-skill resource-constrained project scheduling problem: A dandelion solution approach
This paper proposes a new mixed-integer model for the multi-skill resource-constrained project scheduling problem (MSRCPSP). The interactions between workers are represented as undirected networks. Therefore, for each required skill, an undirected network is formed which shows the relations of human resources. In this paper, community detection in networks is used to find the most compatible wo...
متن کاملMorphological Exudate Detection in Retinal Images using PCA-based Optic Disc Removal
Diabetic retinopathy lesion detection such as exudate in fundus image of retina can lead to early diagnosis of the disease. Retinal image includes dark areas such as main blood vessels and retinal tissue and also bright areas such as optic disk, optical fibers and lesions e.g. exudate. In this paper, a multistage algorithm for the detection of exudate in foreground is proposed. The algorithm se...
متن کاملA practical algorithm for [r, s, t]-coloring of graph
Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...
متن کاملA generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کامل